Перевод: с английского на русский

с русского на английский

queue-length distribution

См. также в других словарях:

  • Long-tail traffic — This article covers a range of tools from different disciplines that may be used in the important science of determining the probability of rare events. The terms long range dependent , self similar and heavy tailed are very close in meaning.… …   Wikipedia

  • Long-range dependency — A self similar phenomenon behaves the same when viewed at different degrees of magnification, or different scales on a dimension (space or time). Self similar processes can be described using heavy tailed distributions, also known as long tailed… …   Wikipedia

  • Pollaczek–Khinchine formula — In queueing theory, a discipline within the mathematical theory of probability, the Pollaczek–Khinchine formula is a formula for the mean queue length in a model where jobs arrive according to a Poisson process and service times have a general… …   Wikipedia

  • Moving average — For other uses, see Moving average (disambiguation). In statistics, a moving average, also called rolling average, rolling mean or running average, is a type of finite impulse response filter used to analyze a set of data points by creating a… …   Wikipedia

  • Gordon–Newell theorem — In queueing theory, a discipline within the mathematical theory of probability, the Gordon–Newell theorem is an extension of Jackson s theorem from open queueing networks to closed queueing networks of exponential servers.[1] We cannot apply… …   Wikipedia

  • probability theory — Math., Statistics. the theory of analyzing and making statements concerning the probability of the occurrence of uncertain events. Cf. probability (def. 4). [1830 40] * * * Branch of mathematics that deals with analysis of random events.… …   Universalium

  • Huffman coding — Huffman tree generated from the exact frequencies of the text this is an example of a huffman tree . The frequencies and codes of each character are below. Encoding the sentence with this code requires 135 bits, as opposed of 288 bits if 36… …   Wikipedia

  • Queueing theory — is the mathematical study of waiting lines (or s ). The theory enables mathematical analysis of several related processes, including arriving at the (back of the) queue, waiting in the queue (essentially a storage process), and being served by… …   Wikipedia

  • UnShuffle sort — is a sort algorithm. IntroductionThe UnShuffle Sort is a distribution or merge sort which was developed by Art S. Kagel. UnShuffle is most efficient when sorting data which exhibits low entropy, in effect where the data is well ordered or… …   Wikipedia

  • Oiseau-mouche — Trochilidae Colibri …   Wikipédia en Français

  • Oiseau mouche — Trochilidae Colibri …   Wikipédia en Français

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»